Efficient Iterative Solutions to General Coupled Matrix Equations
نویسندگان
چکیده
منابع مشابه
Efficient Solutions of Coupled Matrix and Matrix Differential Equations
In Kronecker products works, matrices are some times regarded as vectors and vectors are some times made in to matrices. To be precise about these reshaping we use the vector and diagonal extraction operators. In the present paper, the results are organized in the following ways. First, we formulate the coupled matrix linear least-squares problem and present the efficient solutions of this prob...
متن کاملIterative least-squares solutions of coupled Sylvester matrix equations
In this paper, we present a general family of iterative methods to solve linear equations, which includes the well-known Jacobi and Gauss–Seidel iterations as its special cases. The methods are extended to solve coupled Sylvester matrix equations. In our approach, we regard the unknown matrices to be solved as the system parameters to be identified, and propose a least-squares iterative algorit...
متن کاملIterative Solutions to Some Linear Matrix Equations
In this paper the gradient based iterative algorithms are presented to solve the following four types linear matrix equations: (a) AXB = F ; (b) AXB = F, CXD = G; (c) AXB = F s. t. X = X ; (d) AXB+CY D = F, where X and Y are unknown matrices, A,B,C,D, F,G are the given constant matrices. It is proved that if the equation considered has a solution, then the unique minimum norm solution can be ob...
متن کاملAn iterative algorithm for the generalized re”exive solutions of the general coupled matrix equations
(including the generalized coupled Sylvester matrix equations as special cases) have numerous applications in control and system theory. In this paper, an iterative algorithm is constructed to solve the general coupled matrix equations and their optimal approximation problem over generalized reflexive matrix solution (X1,X2, . . . ,Xq). When the general coupled matrix equations are consistent o...
متن کاملAn accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Automation and Computing
سال: 2013
ISSN: 1476-8186,1751-8520
DOI: 10.1007/s11633-013-0745-6